Maximal Common Subsequences and Minimal Common Supersequences
نویسندگان
چکیده
منابع مشابه
Maximal Common Subsequences and Minimal Common Supersequences Proposed Running Head: Common Subsequences and Supersequences
The problems of nding a longest common subsequence and a shortest common supersequence of a set of strings are well-known. They can be solved in polynomial time for two strings (in fact the problems are dual in this case), or for any xed number of strings, by dynamic programming. But both problems are NP-hard in general for an arbitrary number k of strings. Here we study the related problems of...
متن کاملLength of Maximal Common Subsequences
The problem of computing the length of the maximal common subsequences of two strings is quite well examined in the sequential case. There are many variations, but the standard approach is to compute the length in quadratic time using dynamic programming. A lineartime parallel algorithm can be obtained via a simple modification of this strategy by letting a linear number of processors sweep thr...
متن کاملCommon Subsequences and Supersequences and Their expected Length
Let f(n; k; l) be the expected length of a longest common subse-quence of l sequences of length n over an alphabet of size k. It is known that there are constants (l) k such that f(n; k; l) ! (l) k n, we show that (l) k = (k 1=l?1). Bounds for the corresponding constants for the expected length of a shortest common supersequence are also presented.
متن کاملOn the Approximation of Shortest Common Supersequences and Longest Common Subsequences
The problems of finding shortest common supersequences (SCS) and longest common subsequences (LCS) are two well-known NP-hard problems that have applications in many areas, including computational molecular biology, data compression, robot motion planning, and scheduling, text editing, etc. A lot of fruitless effort has been spent in searching for good approximation algorithms for these problem...
متن کاملAll Common Subsequences
Time series data abounds in real world problems. Measuring the similarity of time series is a key to solving these problems. One state of the art measure is the longest common subsequence. This measure advocates using the length of the longest common subsequence as an indication of similarity between sequences, but ignores information contained in the second, third, ..., longest subsequences. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1996
ISSN: 0890-5401
DOI: 10.1006/inco.1996.0011